________________________________________________________________

Run Header: Complete YList Version try 5: /small pw steps

Run start:        31.01.2010 11:29:11
Input Data from:  dataset155.txt
Iteration limit:  500
NI iter. limit:   200

# of Customers  :200
# of Locations  :20
Ex.Facilities   :3
Total budget    :25000
Terror. attacks :1

Penalty Weight : 0,5
Update Policy  : 4-3 of last 10
pw inc. step   : 0,005

Coverage Ratio :0,06275
Average f[i]   :4425
Average g[i,j] :1988,23529411765
Total demand   :10920
________________________________________________________________

## ITERATION 0 #######################


> Neighbours evaluated; 21
> Selected Move:	2080	1	-1	4	6000


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0    >new incumb.: 2080


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 1 #######################


> Neighbours evaluated; 22
> Selected Move:	2590	1	-1	5	12000


> New Y[]: 
	
	 2  3  4  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0    >new incumb.: 2590


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 2 #######################


> Neighbours evaluated; 31
> Selected Move:	3470	1	-1	18	16000


> New Y[]: 
	
	 2  3  4  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0    >new incumb.: 3470


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 3 #######################


> Neighbours evaluated; 13
> Selected Move:	4320	1	-1	19	20500


> New Y[]: 
	
	 2  3  4  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  1  1    >new incumb.: 4320


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 4 #######################


> Neighbours evaluated; 13
> Selected Move:	5150	1	-1	11	25000


> New Y[]: 
	
	 2  3  4  0  1  1  0  0  0  0  0  1  0  0  0  0  0  0  1  1    >new incumb.: 5150


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 5 #######################


> Neighbours evaluated; 12
> Selected Move:	5150	3	5	6	24000


> New Y[]: 
	
	 2  3  4  0  1  0  1  0  0  0  0  1  0  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 6 #######################


> Neighbours evaluated; 15
> Selected Move:	5130	3	4	7	24500


> New Y[]: 
	
	 2  3  4  0  0  0  1  1  0  0  0  1  0  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,495

## ITERATION 7 #######################


> Neighbours evaluated; 11
> Selected Move:	5120	3	7	9	24500


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  0  1  0  1  0  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,49

## ITERATION 8 #######################


> Neighbours evaluated; 14
> Selected Move:	4990	3	0	4	26000


> New Y[]: 
	
	 0  3  4  0  2  0  1  0  0  1  0  1  0  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,485

## ITERATION 9 #######################


> Neighbours evaluated; 25
> Selected Move:	5320	3	9	16	23500


> New Y[]: 
	
	 0  3  4  0  2  0  1  0  0  0  0  1  0  0  0  0  1  0  1  1    >new incumb.: 5320


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,48

## ITERATION 10 #######################


> Neighbours evaluated; 39
> Selected Move:	5320	4	4	6	24600


> New Y[]: 
	
	 0  3  4  0  1  0  2  0  0  0  0  1  0  0  0  0  1  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,475

## ITERATION 11 #######################


> Neighbours evaluated; 31
> Selected Move:	5320	3	6	5	24800


> New Y[]: 
	
	 0  3  4  0  1  2  0  0  0  0  0  1  0  0  0  0  1  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,47

## ITERATION 12 #######################


> Neighbours evaluated; 29
> Selected Move:	5320	4	5	4	24500


> New Y[]: 
	
	 0  3  4  0  2  1  0  0  0  0  0  1  0  0  0  0  1  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,465

## ITERATION 13 #######################


> Neighbours evaluated; 40
> Selected Move:	5300	3	4	7	24800


> New Y[]: 
	
	 0  3  4  0  0  1  0  2  0  0  0  1  0  0  0  0  1  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,46

## ITERATION 14 #######################


> Neighbours evaluated; 30
> Selected Move:	5330	3	16	12	24800


> New Y[]: 
	
	 0  3  4  0  0  1  0  2  0  0  0  1  1  0  0  0  0  0  1  1    >new incumb.: 5330


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,455

## ITERATION 15 #######################


> Neighbours evaluated; 17
> Selected Move:	5330	3	5	6	23800


> New Y[]: 
	
	 0  3  4  0  0  0  1  2  0  0  0  1  1  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,45

## ITERATION 16 #######################


> Neighbours evaluated; 20
> Selected Move:	5320	3	7	9	24400


> New Y[]: 
	
	 0  3  4  0  0  0  1  0  0  2  0  1  1  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,445

## ITERATION 17 #######################


> Neighbours evaluated; 20
> Selected Move:	5290	3	12	16	24400


> New Y[]: 
	
	 0  3  4  0  0  0  1  0  0  2  0  1  0  0  0  0  1  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,44

## ITERATION 18 #######################


> Neighbours evaluated; 33
> Selected Move:	5300	3	9	7	23800


> New Y[]: 
	
	 0  3  4  0  0  0  1  2  0  0  0  1  0  0  0  0  1  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,435

## ITERATION 19 #######################


> Neighbours evaluated; 43
> Selected Move:	5257	4	7	6	25100


> New Y[]: 
	
	 0  3  4  0  0  0  2  1  0  0  0  1  0  0  0  0  1  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,43

## ITERATION 20 #######################


> Neighbours evaluated; 33
> Selected Move:	5287	3	16	12	25100


> New Y[]: 
	
	 0  3  4  0  0  0  2  1  0  0  0  1  1  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,425

## ITERATION 21 #######################


> Neighbours evaluated; 19
> Selected Move:	5278	3	7	9	25100


> New Y[]: 
	
	 0  3  4  0  0  0  2  0  0  1  0  1  1  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,42

## ITERATION 22 #######################


> Neighbours evaluated; 21
> Selected Move:	5248	3	12	16	25100


> New Y[]: 
	
	 0  3  4  0  0  0  2  0  0  1  0  1  0  0  0  0  1  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,415

## ITERATION 23 #######################


> Neighbours evaluated; 39
> Selected Move:	5220	3	19	8	24600


> New Y[]: 
	
	 0  3  4  0  0  0  2  0  1  1  0  1  0  0  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,41

## ITERATION 24 #######################


> Neighbours evaluated; 22
> Selected Move:	5250	3	9	4	24100


> New Y[]: 
	
	 0  3  4  0  1  0  2  0  1  0  0  1  0  0  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,405

## ITERATION 25 #######################


> Neighbours evaluated; 23
> Selected Move:	5250	4	6	4	23000


> New Y[]: 
	
	 0  3  4  0  2  0  1  0  1  0  0  1  0  0  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,4

## ITERATION 26 #######################


> Neighbours evaluated; 26
> Selected Move:	5250	4	4	11	24600


> New Y[]: 
	
	 0  3  4  0  1  0  1  0  1  0  0  2  0  0  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,395

## ITERATION 27 #######################


> Neighbours evaluated; 19
> Selected Move:	5281	3	8	19	25100


> New Y[]: 
	
	 0  3  4  0  1  0  1  0  0  0  0  2  0  0  0  0  1  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,4

## ITERATION 28 #######################


> Neighbours evaluated; 38
> Selected Move:	5160	3	4	12	23100


> New Y[]: 
	
	 0  3  4  0  0  0  1  0  0  0  0  2  1  0  0  0  1  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,405

## ITERATION 29 #######################


> Neighbours evaluated; 51
> Selected Move:	5160	4	11	6	22600


> New Y[]: 
	
	 0  3  4  0  0  0  2  0  0  0  0  1  1  0  0  0  1  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,4

## ITERATION 30 #######################


> Neighbours evaluated; 48
> Selected Move:	5200	3	16	4	24600


> New Y[]: 
	
	 0  3  4  0  1  0  2  0  0  0  0  1  1  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,395

## ITERATION 31 #######################


> Neighbours evaluated; 20
> Selected Move:	5231	3	12	15	25100


> New Y[]: 
	
	 0  3  4  0  1  0  2  0  0  0  0  1  0  0  0  1  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 32 #######################


> Neighbours evaluated; 16
> Selected Move:	5270	4	6	4	24000


> New Y[]: 
	
	 0  3  4  0  2  0  1  0  0  0  0  1  0  0  0  1  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 33 #######################


> Neighbours evaluated; 23
> Selected Move:	5270	3	6	5	25000


> New Y[]: 
	
	 0  3  4  0  2  1  0  0  0  0  0  1  0  0  0  1  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,38

## ITERATION 34 #######################


> Neighbours evaluated; 20
> Selected Move:	5250	3	15	3	25000


> New Y[]: 
	
	 0  3  4  1  2  1  0  0  0  0  0  1  0  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 35 #######################


> Neighbours evaluated; 22
> Selected Move:	5250	3	5	6	24000


> New Y[]: 
	
	 0  3  4  1  2  0  1  0  0  0  0  1  0  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 36 #######################


> Neighbours evaluated; 22
> Selected Move:	5250	3	3	17	25000


> New Y[]: 
	
	 0  3  4  0  2  0  1  0  0  0  0  1  0  0  0  0  0  1  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 37 #######################


> Neighbours evaluated; 23
> Selected Move:	5200	3	17	12	23500


> New Y[]: 
	
	 0  3  4  0  2  0  1  0  0  0  0  1  1  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 38 #######################


> Neighbours evaluated; 21
> Selected Move:	5200	3	6	5	24500


> New Y[]: 
	
	 0  3  4  0  2  1  0  0  0  0  0  1  1  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 39 #######################


> Neighbours evaluated; 17
> Selected Move:	5200	4	4	5	24800


> New Y[]: 
	
	 0  3  4  0  1  2  0  0  0  0  0  1  1  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 40 #######################


> Neighbours evaluated; 21
> Selected Move:	5225	3	4	7	25300


> New Y[]: 
	
	 0  3  4  0  0  2  0  1  0  0  0  1  1  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 41 #######################


> Neighbours evaluated; 27
> Selected Move:	5197	3	12	16	25300


> New Y[]: 
	
	 0  3  4  0  0  2  0  1  0  0  0  1  0  0  0  0  1  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 42 #######################


> Neighbours evaluated; 46
> Selected Move:	5230	3	19	8	24800


> New Y[]: 
	
	 0  3  4  0  0  2  0  1  1  0  0  1  0  0  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 43 #######################


> Neighbours evaluated; 20
> Selected Move:	5250	3	7	4	24300


> New Y[]: 
	
	 0  3  4  0  1  2  0  0  1  0  0  1  0  0  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 44 #######################


> Neighbours evaluated; 18
> Selected Move:	5250	4	5	4	24000


> New Y[]: 
	
	 0  3  4  0  2  1  0  0  1  0  0  1  0  0  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 45 #######################


> Neighbours evaluated; 22
> Selected Move:	5230	3	4	7	24300


> New Y[]: 
	
	 0  3  4  0  0  1  0  2  1  0  0  1  0  0  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 46 #######################


> Neighbours evaluated; 23
> Selected Move:	5230	3	5	6	23300


> New Y[]: 
	
	 0  3  4  0  0  0  1  2  1  0  0  1  0  0  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 47 #######################


> Neighbours evaluated; 25
> Selected Move:	5246	3	8	4	25300


> New Y[]: 
	
	 0  3  4  0  1  0  1  2  0  0  0  1  0  0  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 48 #######################


> Neighbours evaluated; 20
> Selected Move:	5242	3	16	19	25800


> New Y[]: 
	
	 0  3  4  0  1  0  1  2  0  0  0  1  0  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 49 #######################


> Neighbours evaluated; 19
> Selected Move:	5250	3	4	15	24300


> New Y[]: 
	
	 0  3  4  0  0  0  1  2  0  0  0  1  0  0  0  1  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 50 #######################


> Neighbours evaluated; 19
> Selected Move:	5240	3	7	9	24900


> New Y[]: 
	
	 0  3  4  0  0  0  1  0  0  2  0  1  0  0  0  1  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 51 #######################


> Neighbours evaluated; 22
> Selected Move:	5220	3	15	3	24900


> New Y[]: 
	
	 0  3  4  1  0  0  1  0  0  2  0  1  0  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 52 #######################


> Neighbours evaluated; 20
> Selected Move:	5230	3	9	7	24300


> New Y[]: 
	
	 0  3  4  1  0  0  1  2  0  0  0  1  0  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 53 #######################


> Neighbours evaluated; 24
> Selected Move:	5145	3	3	17	25300


> New Y[]: 
	
	 0  3  4  0  0  0  1  2  0  0  0  1  0  0  0  0  0  1  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 54 #######################


> Neighbours evaluated; 23
> Selected Move:	5096	3	17	9	26300


> New Y[]: 
	
	 0  3  4  0  0  0  1  2  0  1  0  1  0  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 55 #######################


> Neighbours evaluated; 22
> Selected Move:	5090	3	19	16	25800


> New Y[]: 
	
	 0  3  4  0  0  0  1  2  0  1  0  1  0  0  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 56 #######################


> Neighbours evaluated; 22
> Selected Move:	5190	3	7	4	25500


> New Y[]: 
	
	 0  3  4  0  2  0  1  0  0  1  0  1  0  0  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 57 #######################


> Neighbours evaluated; 22
> Selected Move:	5198	3	9	7	25500


> New Y[]: 
	
	 0  3  4  0  2  0  1  1  0  0  0  1  0  0  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 58 #######################


> Neighbours evaluated; 24
> Selected Move:	5200	3	16	19	26000


> New Y[]: 
	
	 0  3  4  0  2  0  1  1  0  0  0  1  0  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 59 #######################


> Neighbours evaluated; 22
> Selected Move:	5133	3	7	5	25500


> New Y[]: 
	
	 0  3  4  0  2  1  1  0  0  0  0  1  0  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 60 #######################


> Neighbours evaluated; 20
> Selected Move:	5130	3	19	16	25000


> New Y[]: 
	
	 0  3  4  0  2  1  1  0  0  0  0  1  0  0  0  0  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 61 #######################


> Neighbours evaluated; 22
> Selected Move:	5120	3	5	15	23500


> New Y[]: 
	
	 0  3  4  0  2  0  1  0  0  0  0  1  0  0  0  1  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 62 #######################


> Neighbours evaluated; 24
> Selected Move:	5120	4	4	6	24600


> New Y[]: 
	
	 0  3  4  0  1  0  2  0  0  0  0  1  0  0  0  1  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 63 #######################


> Neighbours evaluated; 20
> Selected Move:	5120	3	6	5	24800


> New Y[]: 
	
	 0  3  4  0  1  2  0  0  0  0  0  1  0  0  0  1  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 64 #######################


> Neighbours evaluated; 18
> Selected Move:	5174	3	16	19	25300


> New Y[]: 
	
	 0  3  4  0  1  2  0  0  0  0  0  1  0  0  0  1  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 65 #######################


> Neighbours evaluated; 22
> Selected Move:	5153	3	15	3	25300


> New Y[]: 
	
	 0  3  4  1  1  2  0  0  0  0  0  1  0  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 66 #######################


> Neighbours evaluated; 25
> Selected Move:	5217	3	5	6	25100


> New Y[]: 
	
	 0  3  4  1  1  0  2  0  0  0  0  1  0  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 67 #######################


> Neighbours evaluated; 25
> Selected Move:	5100	3	19	16	24600


> New Y[]: 
	
	 0  3  4  1  1  0  2  0  0  0  0  1  0  0  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 68 #######################


> Neighbours evaluated; 30
> Selected Move:	5100	4	6	4	23500


> New Y[]: 
	
	 0  3  4  1  2  0  1  0  0  0  0  1  0  0  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 69 #######################


> Neighbours evaluated; 32
> Selected Move:	5100	3	3	17	24500


> New Y[]: 
	
	 0  3  4  0  2  0  1  0  0  0  0  1  0  0  0  0  1  1  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 70 #######################


> Neighbours evaluated; 29
> Selected Move:	5080	3	4	7	24800


> New Y[]: 
	
	 0  3  4  0  0  0  1  2  0  0  0  1  0  0  0  0  1  1  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 71 #######################


> Neighbours evaluated; 30
> Selected Move:	5180	3	17	12	23300


> New Y[]: 
	
	 0  3  4  0  0  0  1  2  0  0  0  1  1  0  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 72 #######################


> Neighbours evaluated; 23
> Selected Move:	5180	4	7	6	24600


> New Y[]: 
	
	 0  3  4  0  0  0  2  1  0  0  0  1  1  0  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 73 #######################


> Neighbours evaluated; 18
> Selected Move:	5230	3	12	8	24600


> New Y[]: 
	
	 0  3  4  0  0  0  2  1  1  0  0  1  0  0  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 74 #######################


> Neighbours evaluated; 19
> Selected Move:	5199	4	6	11	25100


> New Y[]: 
	
	 0  3  4  0  0  0  1  1  1  0  0  2  0  0  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 75 #######################


> Neighbours evaluated; 21
> Selected Move:	5190	3	7	9	25100


> New Y[]: 
	
	 0  3  4  0  0  0  1  0  1  1  0  2  0  0  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 76 #######################


> Neighbours evaluated; 17
> Selected Move:	5220	4	11	9	23900


> New Y[]: 
	
	 0  3  4  0  0  0  1  0  1  2  0  1  0  0  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 77 #######################


> Neighbours evaluated; 25
> Selected Move:	5170	3	8	12	23900


> New Y[]: 
	
	 0  3  4  0  0  0  1  0  0  2  0  1  1  0  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 78 #######################


> Neighbours evaluated; 18
> Selected Move:	5170	4	9	6	24600


> New Y[]: 
	
	 0  3  4  0  0  0  2  0  0  1  0  1  1  0  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 79 #######################


> Neighbours evaluated; 17
> Selected Move:	5142	4	6	11	25100


> New Y[]: 
	
	 0  3  4  0  0  0  1  0  0  1  0  2  1  0  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 80 #######################


> Neighbours evaluated; 20
> Selected Move:	5152	3	9	7	25100


> New Y[]: 
	
	 0  3  4  0  0  0  1  1  0  0  0  2  1  0  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 81 #######################


> Neighbours evaluated; 22
> Selected Move:	5165	3	16	19	25600


> New Y[]: 
	
	 0  3  4  0  0  0  1  1  0  0  0  2  1  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 82 #######################


> Neighbours evaluated; 22
> Selected Move:	5172	3	7	4	25100


> New Y[]: 
	
	 0  3  4  0  1  0  1  0  0  0  0  2  1  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 83 #######################


> Neighbours evaluated; 22
> Selected Move:	5149	3	4	9	25600


> New Y[]: 
	
	 0  3  4  0  0  0  1  0  0  1  0  2  1  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 84 #######################


> Neighbours evaluated; 22
> Selected Move:	5116	3	12	16	25600


> New Y[]: 
	
	 0  3  4  0  0  0  1  0  0  1  0  2  0  0  0  0  1  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 85 #######################


> Neighbours evaluated; 36
> Selected Move:	5123	3	9	7	25600


> New Y[]: 
	
	 0  3  4  0  0  0  1  1  0  0  0  2  0  0  0  0  1  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 86 #######################


> Neighbours evaluated; 36
> Selected Move:	5080	3	7	15	23600


> New Y[]: 
	
	 0  3  4  0  0  0  1  0  0  0  0  2  0  0  0  1  1  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 87 #######################


> Neighbours evaluated; 43
> Selected Move:	5110	3	16	12	23600


> New Y[]: 
	
	 0  3  4  0  0  0  1  0  0  0  0  2  1  0  0  1  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 88 #######################


> Neighbours evaluated; 24
> Selected Move:	5110	4	11	6	23100


> New Y[]: 
	
	 0  3  4  0  0  0  2  0  0  0  0  1  1  0  0  1  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 89 #######################


> Neighbours evaluated; 28
> Selected Move:	5149	3	15	10	25100


> New Y[]: 
	
	 0  3  4  0  0  0  2  0  0  0  1  1  1  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 90 #######################


> Neighbours evaluated; 17
> Selected Move:	5180	4	6	10	23500


> New Y[]: 
	
	 0  3  4  0  0  0  1  0  0  0  2  1  1  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 91 #######################


> Neighbours evaluated; 23
> Selected Move:	5180	3	6	5	24500


> New Y[]: 
	
	 0  3  4  0  0  1  0  0  0  0  2  1  1  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 92 #######################


> Neighbours evaluated; 22
> Selected Move:	5150	3	12	16	24500


> New Y[]: 
	
	 0  3  4  0  0  1  0  0  0  0  2  1  0  0  0  0  1  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 93 #######################


> Neighbours evaluated; 34
> Selected Move:	5160	3	10	12	24900


> New Y[]: 
	
	 0  3  4  0  0  1  0  0  0  0  0  1  2  0  0  0  1  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 94 #######################


> Neighbours evaluated; 32
> Selected Move:	5160	4	12	5	22800


> New Y[]: 
	
	 0  3  4  0  0  2  0  0  0  0  0  1  1  0  0  0  1  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 95 #######################


> Neighbours evaluated; 48
> Selected Move:	5180	3	19	7	24800


> New Y[]: 
	
	 0  3  4  0  0  2  0  1  0  0  0  1  1  0  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 96 #######################


> Neighbours evaluated; 15
> Selected Move:	5180	4	5	7	24300


> New Y[]: 
	
	 0  3  4  0  0  1  0  2  0  0  0  1  1  0  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 97 #######################


> Neighbours evaluated; 26
> Selected Move:	5160	3	7	19	24900


> New Y[]: 
	
	 0  3  4  0  0  1  0  0  0  0  0  1  1  0  0  0  1  0  1  2 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 98 #######################


> Neighbours evaluated; 27
> Selected Move:	5160	4	19	11	24100


> New Y[]: 
	
	 0  3  4  0  0  1  0  0  0  0  0  2  1  0  0  0  1  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 99 #######################


> Neighbours evaluated; 36
> Selected Move:	5160	4	11	18	24500


> New Y[]: 
	
	 0  3  4  0  0  1  0  0  0  0  0  1  1  0  0  0  1  0  2  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 100 #######################


> Neighbours evaluated; 34
> Selected Move:	5160	3	5	6	23500


> New Y[]: 
	
	 0  3  4  0  0  0  1  0  0  0  0  1  1  0  0  0  1  0  2  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 101 #######################


> Neighbours evaluated; 43
> Selected Move:	5178	3	12	4	25500


> New Y[]: 
	
	 0  3  4  0  1  0  1  0  0  0  0  1  0  0  0  0  1  0  2  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 102 #######################


> Neighbours evaluated; 39
> Selected Move:	5250	3	19	8	25000


> New Y[]: 
	
	 0  3  4  0  1  0  1  0  1  0  0  1  0  0  0  0  1  0  2  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 103 #######################


> Neighbours evaluated; 18
> Selected Move:	5223	4	18	8	25100


> New Y[]: 
	
	 0  3  4  0  1  0  1  0  2  0  0  1  0  0  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 104 #######################


> Neighbours evaluated; 25
> Selected Move:	5150	3	8	10	25000


> New Y[]: 
	
	 0  3  4  0  1  0  1  0  0  0  2  1  0  0  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 105 #######################


> Neighbours evaluated; 23
> Selected Move:	5168	3	16	19	25500


> New Y[]: 
	
	 0  3  4  0  1  0  1  0  0  0  2  1  0  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 106 #######################


> Neighbours evaluated; 23
> Selected Move:	5150	3	4	16	23500


> New Y[]: 
	
	 0  3  4  0  0  0  1  0  0  0  2  1  0  0  0  0  1  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 107 #######################


> Neighbours evaluated; 47
> Selected Move:	5160	3	10	12	23900


> New Y[]: 
	
	 0  3  4  0  0  0  1  0  0  0  0  1  2  0  0  0  1  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 108 #######################


> Neighbours evaluated; 30
> Selected Move:	5160	4	12	16	24400


> New Y[]: 
	
	 0  3  4  0  0  0  1  0  0  0  0  1  1  0  0  0  2  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 109 #######################


> Neighbours evaluated; 31
> Selected Move:	5160	4	16	19	23900


> New Y[]: 
	
	 0  3  4  0  0  0  1  0  0  0  0  1  1  0  0  0  1  0  1  2 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 110 #######################


> Neighbours evaluated; 71
> Selected Move:	5110	3	16	15	24400


> New Y[]: 
	
	 0  3  4  0  0  0  1  0  0  0  0  1  1  0  0  1  0  0  1  2 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 111 #######################


> Neighbours evaluated; 20
> Selected Move:	5110	4	19	12	24400


> New Y[]: 
	
	 0  3  4  0  0  0  1  0  0  0  0  1  2  0  0  1  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 112 #######################


> Neighbours evaluated; 21
> Selected Move:	5110	4	12	15	24100


> New Y[]: 
	
	 0  3  4  0  0  0  1  0  0  0  0  1  1  0  0  2  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 113 #######################


> Neighbours evaluated; 23
> Selected Move:	5120	3	15	5	23800


> New Y[]: 
	
	 0  3  4  0  0  2  1  0  0  0  0  1  1  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,22

## ITERATION 114 #######################


> Neighbours evaluated; 27
> Selected Move:	5120	4	5	6	24600


> New Y[]: 
	
	 0  3  4  0  0  1  2  0  0  0  0  1  1  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,215

## ITERATION 115 #######################


> Neighbours evaluated; 26
> Selected Move:	5099	4	6	11	25100


> New Y[]: 
	
	 0  3  4  0  0  1  1  0  0  0  0  2  1  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 116 #######################


> Neighbours evaluated; 23
> Selected Move:	5110	3	6	15	24600


> New Y[]: 
	
	 0  3  4  0  0  1  0  0  0  0  0  2  1  0  0  1  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 117 #######################


> Neighbours evaluated; 22
> Selected Move:	5110	4	11	5	23300


> New Y[]: 
	
	 0  3  4  0  0  2  0  0  0  0  0  1  1  0  0  1  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,2

## ITERATION 118 #######################


> Neighbours evaluated; 29
> Selected Move:	5120	3	15	9	25300


> New Y[]: 
	
	 0  3  4  0  0  2  0  0  0  1  0  1  1  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,195

## ITERATION 119 #######################


> Neighbours evaluated; 19
> Selected Move:	5122	3	9	10	25300


> New Y[]: 
	
	 0  3  4  0  0  2  0  0  0  0  1  1  1  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,19

## ITERATION 120 #######################


> Neighbours evaluated; 23
> Selected Move:	5093	3	12	16	25300


> New Y[]: 
	
	 0  3  4  0  0  2  0  0  0  0  1  1  0  0  0  0  1  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,185

## ITERATION 121 #######################


> Neighbours evaluated; 40
> Selected Move:	5132	3	5	6	25100


> New Y[]: 
	
	 0  3  4  0  0  0  2  0  0  0  1  1  0  0  0  0  1  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,19

## ITERATION 122 #######################


> Neighbours evaluated; 37
> Selected Move:	5090	3	10	5	24600


> New Y[]: 
	
	 0  3  4  0  0  1  2  0  0  0  0  1  0  0  0  0  1  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,195

## ITERATION 123 #######################


> Neighbours evaluated; 39
> Selected Move:	5090	4	6	5	23800


> New Y[]: 
	
	 0  3  4  0  0  2  1  0  0  0  0  1  0  0  0  0  1  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,2

## ITERATION 124 #######################


> Neighbours evaluated; 43
> Selected Move:	5120	3	16	4	25800


> New Y[]: 
	
	 0  3  4  0  1  2  1  0  0  0  0  1  0  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 125 #######################


> Neighbours evaluated; 23
> Selected Move:	5193	3	5	9	26400


> New Y[]: 
	
	 0  3  4  0  1  0  1  0  0  2  0  1  0  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 126 #######################


> Neighbours evaluated; 23
> Selected Move:	5141	3	19	16	25900


> New Y[]: 
	
	 0  3  4  0  1  0  1  0  0  2  0  1  0  0  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,215

## ITERATION 127 #######################


> Neighbours evaluated; 20
> Selected Move:	5127	3	9	19	25900


> New Y[]: 
	
	 0  3  4  0  1  0  1  0  0  0  0  1  0  0  0  0  1  0  1  2 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,22

## ITERATION 128 #######################


> Neighbours evaluated; 38
> Selected Move:	5080	3	4	15	24400


> New Y[]: 
	
	 0  3  4  0  0  0  1  0  0  0  0  1  0  0  0  1  1  0  1  2 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 129 #######################


> Neighbours evaluated; 38
> Selected Move:	5100	3	19	7	23800


> New Y[]: 
	
	 0  3  4  0  0  0  1  2  0  0  0  1  0  0  0  1  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 130 #######################


> Neighbours evaluated; 19
> Selected Move:	5100	3	6	5	24800


> New Y[]: 
	
	 0  3  4  0  0  1  0  2  0  0  0  1  0  0  0  1  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 131 #######################


> Neighbours evaluated; 19
> Selected Move:	5180	3	16	19	25300


> New Y[]: 
	
	 0  3  4  0  0  1  0  2  0  0  0  1  0  0  0  1  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 132 #######################


> Neighbours evaluated; 21
> Selected Move:	5158	3	15	3	25300


> New Y[]: 
	
	 0  3  4  1  0  1  0  2  0  0  0  1  0  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 133 #######################


> Neighbours evaluated; 27
> Selected Move:	5080	3	19	16	24800


> New Y[]: 
	
	 0  3  4  1  0  1  0  2  0  0  0  1  0  0  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 134 #######################


> Neighbours evaluated; 32
> Selected Move:	5100	3	7	4	24500


> New Y[]: 
	
	 0  3  4  1  2  1  0  0  0  0  0  1  0  0  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 135 #######################


> Neighbours evaluated; 29
> Selected Move:	5120	3	3	15	24500


> New Y[]: 
	
	 0  3  4  0  2  1  0  0  0  0  0  1  0  0  0  1  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 136 #######################


> Neighbours evaluated; 26
> Selected Move:	5050	3	15	12	24000


> New Y[]: 
	
	 0  3  4  0  2  1  0  0  0  0  0  1  1  0  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 137 #######################


> Neighbours evaluated; 21
> Selected Move:	5090	3	4	8	24100


> New Y[]: 
	
	 0  3  4  0  0  1  0  0  2  0  0  1  1  0  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 138 #######################


> Neighbours evaluated; 26
> Selected Move:	5090	4	8	5	22300


> New Y[]: 
	
	 0  3  4  0  0  2  0  0  1  0  0  1  1  0  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 139 #######################


> Neighbours evaluated; 33
> Selected Move:	5090	4	5	11	23600


> New Y[]: 
	
	 0  3  4  0  0  1  0  0  1  0  0  2  1  0  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 140 #######################


> Neighbours evaluated; 26
> Selected Move:	5112	3	12	4	25600


> New Y[]: 
	
	 0  3  4  0  1  1  0  0  1  0  0  2  0  0  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 141 #######################


> Neighbours evaluated; 25
> Selected Move:	5073	3	8	19	26100


> New Y[]: 
	
	 0  3  4  0  1  1  0  0  0  0  0  2  0  0  0  0  1  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,22

## ITERATION 142 #######################


> Neighbours evaluated; 39
> Selected Move:	5080	3	4	15	24600


> New Y[]: 
	
	 0  3  4  0  0  1  0  0  0  0  0  2  0  0  0  1  1  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,215

## ITERATION 143 #######################


> Neighbours evaluated; 41
> Selected Move:	5080	4	11	5	23300


> New Y[]: 
	
	 0  3  4  0  0  2  0  0  0  0  0  1  0  0  0  1  1  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 144 #######################


> Neighbours evaluated; 50
> Selected Move:	5087	3	15	9	25300


> New Y[]: 
	
	 0  3  4  0  0  2  0  0  0  1  0  1  0  0  0  0  1  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 145 #######################


> Neighbours evaluated; 33
> Selected Move:	5080	3	19	8	24800


> New Y[]: 
	
	 0  3  4  0  0  2  0  0  1  1  0  1  0  0  0  0  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,2

## ITERATION 146 #######################


> Neighbours evaluated; 23
> Selected Move:	5080	4	5	9	24900


> New Y[]: 
	
	 0  3  4  0  0  1  0  0  1  2  0  1  0  0  0  0  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,195

## ITERATION 147 #######################


> Neighbours evaluated; 25
> Selected Move:	5090	3	9	12	24400


> New Y[]: 
	
	 0  3  4  0  0  1  0  0  1  0  0  1  2  0  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,19

## ITERATION 148 #######################


> Neighbours evaluated; 23
> Selected Move:	5090	4	12	16	24900


> New Y[]: 
	
	 0  3  4  0  0  1  0  0  1  0  0  1  1  0  0  0  2  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,185

## ITERATION 149 #######################


> Neighbours evaluated; 21
> Selected Move:	5090	4	16	18	24000


> New Y[]: 
	
	 0  3  4  0  0  1  0  0  1  0  0  1  1  0  0  0  1  0  2  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,18

## ITERATION 150 #######################


> Neighbours evaluated; 34
> Selected Move:	5090	3	5	6	23000


> New Y[]: 
	
	 0  3  4  0  0  0  1  0  1  0  0  1  1  0  0  0  1  0  2  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,175

## ITERATION 151 #######################


> Neighbours evaluated; 34
> Selected Move:	5143	3	12	7	25500


> New Y[]: 
	
	 0  3  4  0  0  0  1  1  1  0  0  1  0  0  0  0  1  0  2  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,17

## ITERATION 152 #######################


> Neighbours evaluated; 23
> Selected Move:	5135	3	7	9	25500


> New Y[]: 
	
	 0  3  4  0  0  0  1  0  1  1  0  1  0  0  0  0  1  0  2  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,165

## ITERATION 153 #######################


> Neighbours evaluated; 22
> Selected Move:	5125	3	8	19	26000


> New Y[]: 
	
	 0  3  4  0  0  0  1  0  0  1  0  1  0  0  0  0  1  0  2  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,16

## ITERATION 154 #######################


> Neighbours evaluated; 36
> Selected Move:	5160	3	16	12	26000


> New Y[]: 
	
	 0  3  4  0  0  0  1  0  0  1  0  1  1  0  0  0  0  0  2  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,155

## ITERATION 155 #######################


> Neighbours evaluated; 23
> Selected Move:	5175	3	9	7	26000


> New Y[]: 
	
	 0  3  4  0  0  0  1  1  0  0  0  1  1  0  0  0  0  0  2  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,16

## ITERATION 156 #######################


> Neighbours evaluated; 25
> Selected Move:	5140	3	12	16	26000


> New Y[]: 
	
	 0  3  4  0  0  0  1  1  0  0  0  1  0  0  0  0  1  0  2  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,165

## ITERATION 157 #######################


> Neighbours evaluated; 44
> Selected Move:	5098	3	19	12	25500


> New Y[]: 
	
	 0  3  4  0  0  0  1  1  0  0  0  1  1  0  0  0  1  0  2  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,17

## ITERATION 158 #######################


> Neighbours evaluated; 20
> Selected Move:	5085	3	7	9	25500


> New Y[]: 
	
	 0  3  4  0  0  0  1  0  0  1  0  1  1  0  0  0  1  0  2  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,175

## ITERATION 159 #######################


> Neighbours evaluated; 19
> Selected Move:	5050	3	9	4	25000


> New Y[]: 
	
	 0  3  4  0  1  0  1  0  0  0  0  1  1  0  0  0  1  0  2  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,18

## ITERATION 160 #######################


> Neighbours evaluated; 21
> Selected Move:	5110	3	16	19	25500


> New Y[]: 
	
	 0  3  4  0  1  0  1  0  0  0  0  1  1  0  0  0  0  0  2  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,185

## ITERATION 161 #######################


> Neighbours evaluated; 22
> Selected Move:	5110	3	4	15	24000


> New Y[]: 
	
	 0  3  4  0  0  0  1  0  0  0  0  1  1  0  0  1  0  0  2  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,19

## ITERATION 162 #######################


> Neighbours evaluated; 35
> Selected Move:	5110	3	6	5	25000


> New Y[]: 
	
	 0  3  4  0  0  1  0  0  0  0  0  1  1  0  0  1  0  0  2  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,195

## ITERATION 163 #######################


> Neighbours evaluated; 20
> Selected Move:	5091	4	18	15	25100


> New Y[]: 
	
	 0  3  4  0  0  1  0  0  0  0  0  1  1  0  0  2  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,2

## ITERATION 164 #######################


> Neighbours evaluated; 23
> Selected Move:	5100	3	15	9	25400


> New Y[]: 
	
	 0  3  4  0  0  1  0  0  0  2  0  1  1  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 165 #######################


> Neighbours evaluated; 23
> Selected Move:	5078	3	9	16	25400


> New Y[]: 
	
	 0  3  4  0  0  1  0  0  0  0  0  1  1  0  0  0  2  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 166 #######################


> Neighbours evaluated; 70
> Selected Move:	5070	3	16	13	24600


> New Y[]: 
	
	 0  3  4  0  0  1  0  0  0  0  0  1  1  2  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,215

## ITERATION 167 #######################


> Neighbours evaluated; 26
> Selected Move:	5070	3	5	6	23600


> New Y[]: 
	
	 0  3  4  0  0  0  1  0  0  0  0  1  1  2  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,22

## ITERATION 168 #######################


> Neighbours evaluated; 26
> Selected Move:	5148	3	2	7	26100


> New Y[]: 
	
	 0  3  0  0  0  0  1  4  0  0  0  1  1  2  0  0  0  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 169 #######################


> Neighbours evaluated; 22
> Selected Move:	5138	3	7	4	25100


> New Y[]: 
	
	 0  3  0  0  4  0  1  0  0  0  0  1  1  2  0  0  0  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 170 #######################


> Neighbours evaluated; 26
> Selected Move:	5257	3	12	16	25100


> New Y[]: 
	
	 0  3  0  0  4  0  1  0  0  0  0  1  0  2  0  0  1  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 171 #######################


> Neighbours evaluated; 57
> Selected Move:	5210	3	19	8	24600


> New Y[]: 
	
	 0  3  0  0  4  0  1  0  1  0  0  1  0  2  0  0  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 172 #######################


> Neighbours evaluated; 30
> Selected Move:	5146	3	4	7	25600


> New Y[]: 
	
	 0  3  0  0  0  0  1  4  1  0  0  1  0  2  0  0  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 173 #######################


> Neighbours evaluated; 22
> Selected Move:	5119	4	7	13	25700


> New Y[]: 
	
	 0  3  0  0  0  0  1  2  1  0  0  1  0  4  0  0  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 174 #######################


> Neighbours evaluated; 21
> Selected Move:	5110	3	7	4	25400


> New Y[]: 
	
	 0  3  0  0  2  0  1  0  1  0  0  1  0  4  0  0  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 175 #######################


> Neighbours evaluated; 23
> Selected Move:	5060	3	4	0	23900


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  1  0  0  1  0  4  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 176 #######################


> Neighbours evaluated; 22
> Selected Move:	5130	3	8	19	24400


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  0  0  1  0  4  0  0  1  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 177 #######################


> Neighbours evaluated; 55
> Selected Move:	5160	3	16	12	24400


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  0  0  1  1  4  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 178 #######################


> Neighbours evaluated; 24
> Selected Move:	5080	3	12	15	24900


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  0  0  1  0  4  0  1  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 179 #######################


> Neighbours evaluated; 27
> Selected Move:	5000	3	13	4	24000


> New Y[]: 
	
	 2  3  0  0  4  0  1  0  0  0  0  1  0  0  0  1  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 180 #######################


> Neighbours evaluated; 22
> Selected Move:	5068	3	0	13	25600


> New Y[]: 
	
	 0  3  0  0  4  0  1  0  0  0  0  1  0  2  0  1  0  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 181 #######################


> Neighbours evaluated; 25
> Selected Move:	5054	3	19	16	25100


> New Y[]: 
	
	 0  3  0  0  4  0  1  0  0  0  0  1  0  2  0  1  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 182 #######################


> Neighbours evaluated; 29
> Selected Move:	5033	3	15	3	25100


> New Y[]: 
	
	 0  3  0  1  4  0  1  0  0  0  0  1  0  2  0  0  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 183 #######################


> Neighbours evaluated; 38
> Selected Move:	5045	3	16	19	25600


> New Y[]: 
	
	 0  3  0  1  4  0  1  0  0  0  0  1  0  2  0  0  0  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 184 #######################


> Neighbours evaluated; 30
> Selected Move:	4970	3	4	2	24100


> New Y[]: 
	
	 0  3  4  1  0  0  1  0  0  0  0  1  0  2  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 185 #######################


> Neighbours evaluated; 29
> Selected Move:	5090	3	13	12	24400


> New Y[]: 
	
	 0  3  4  1  0  0  1  0  0  0  0  1  2  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 186 #######################


> Neighbours evaluated; 24
> Selected Move:	5090	4	12	3	24400


> New Y[]: 
	
	 0  3  4  2  0  0  1  0  0  0  0  1  1  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 187 #######################


> Neighbours evaluated; 24
> Selected Move:	5090	4	3	6	23100


> New Y[]: 
	
	 0  3  4  1  0  0  2  0  0  0  0  1  1  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 188 #######################


> Neighbours evaluated; 28
> Selected Move:	5090	4	6	11	23600


> New Y[]: 
	
	 0  3  4  1  0  0  1  0  0  0  0  2  1  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 189 #######################


> Neighbours evaluated; 25
> Selected Move:	5097	3	12	4	25600


> New Y[]: 
	
	 0  3  4  1  1  0  1  0  0  0  0  2  0  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 190 #######################


> Neighbours evaluated; 19
> Selected Move:	5114	3	3	15	25600


> New Y[]: 
	
	 0  3  4  0  1  0  1  0  0  0  0  2  0  0  0  1  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 191 #######################


> Neighbours evaluated; 22
> Selected Move:	5094	3	19	16	25100


> New Y[]: 
	
	 0  3  4  0  1  0  1  0  0  0  0  2  0  0  0  1  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 192 #######################


> Neighbours evaluated; 22
> Selected Move:	5073	3	15	3	25100


> New Y[]: 
	
	 0  3  4  1  1  0  1  0  0  0  0  2  0  0  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 193 #######################


> Neighbours evaluated; 28
> Selected Move:	5060	3	4	19	23600


> New Y[]: 
	
	 0  3  4  1  0  0  1  0  0  0  0  2  0  0  0  0  1  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 194 #######################


> Neighbours evaluated; 49
> Selected Move:	5063	3	3	5	25100


> New Y[]: 
	
	 0  3  4  0  0  1  1  0  0  0  0  2  0  0  0  0  1  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 195 #######################


> Neighbours evaluated; 35
> Selected Move:	5060	3	5	17	24600


> New Y[]: 
	
	 0  3  4  0  0  0  1  0  0  0  0  2  0  0  0  0  1  1  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 196 #######################


> Neighbours evaluated; 34
> Selected Move:	5090	3	16	12	24600


> New Y[]: 
	
	 0  3  4  0  0  0  1  0  0  0  0  2  1  0  0  0  0  1  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 197 #######################


> Neighbours evaluated; 19
> Selected Move:	5090	4	11	6	24100


> New Y[]: 
	
	 0  3  4  0  0  0  2  0  0  0  0  1  1  0  0  0  0  1  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 198 #######################


> Neighbours evaluated; 23
> Selected Move:	5090	4	6	17	24500


> New Y[]: 
	
	 0  3  4  0  0  0  1  0  0  0  0  1  1  0  0  0  0  2  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 199 #######################


> Neighbours evaluated; 20
> Selected Move:	5090	4	17	18	25000


> New Y[]: 
	
	 0  3  4  0  0  0  1  0  0  0  0  1  1  0  0  0  0  1  2  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 200 #######################


> Neighbours evaluated; 19
> Selected Move:	5090	3	17	3	24000


> New Y[]: 
	
	 0  3  4  1  0  0  1  0  0  0  0  1  1  0  0  0  0  0  2  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 201 #######################


> Neighbours evaluated; 20
> Selected Move:	5090	4	18	19	24400


> New Y[]: 
	
	 0  3  4  1  0  0  1  0  0  0  0  1  1  0  0  0  0  0  1  2 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 202 #######################


> Neighbours evaluated; 35
> Selected Move:	5060	3	12	16	24400


> New Y[]: 
	
	 0  3  4  1  0  0  1  0  0  0  0  1  0  0  0  0  1  0  1  2 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 203 #######################


> Neighbours evaluated; 41
> Selected Move:	5080	3	19	7	23800


> New Y[]: 
	
	 0  3  4  1  0  0  1  2  0  0  0  1  0  0  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 204 #######################


> Neighbours evaluated; 31
> Selected Move:	5070	3	7	9	24400


> New Y[]: 
	
	 0  3  4  1  0  0  1  0  0  2  0  1  0  0  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 205 #######################


> Neighbours evaluated; 29
> Selected Move:	5090	3	3	15	24400


> New Y[]: 
	
	 0  3  4  0  0  0  1  0  0  2  0  1  0  0  0  1  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 206 #######################


> Neighbours evaluated; 18
> Selected Move:	5064	4	9	6	25100


> New Y[]: 
	
	 0  3  4  0  0  0  2  0  0  1  0  1  0  0  0  1  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 207 #######################


> Neighbours evaluated; 18
> Selected Move:	5087	3	16	19	25600


> New Y[]: 
	
	 0  3  4  0  0  0  2  0  0  1  0  1  0  0  0  1  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 208 #######################


> Neighbours evaluated; 20
> Selected Move:	5100	3	9	7	25600


> New Y[]: 
	
	 0  3  4  0  0  0  2  1  0  0  0  1  0  0  0  1  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 209 #######################


> Neighbours evaluated; 22
> Selected Move:	5083	3	15	3	25600


> New Y[]: 
	
	 0  3  4  1  0  0  2  1  0  0  0  1  0  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 210 #######################


> Neighbours evaluated; 24
> Selected Move:	5076	3	7	9	25600


> New Y[]: 
	
	 0  3  4  1  0  0  2  0  0  1  0  1  0  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 211 #######################


> Neighbours evaluated; 23
> Selected Move:	5060	3	9	16	23100


> New Y[]: 
	
	 0  3  4  1  0  0  2  0  0  0  0  1  0  0  0  0  1  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 212 #######################


> Neighbours evaluated; 52
> Selected Move:	5080	3	3	15	23100


> New Y[]: 
	
	 0  3  4  0  0  0  2  0  0  0  0  1  0  0  0  1  1  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 213 #######################


> Neighbours evaluated; 43
> Selected Move:	5080	4	6	15	24100


> New Y[]: 
	
	 0  3  4  0  0  0  1  0  0  0  0  1  0  0  0  2  1  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 214 #######################


> Neighbours evaluated; 31
> Selected Move:	5080	4	15	16	24900


> New Y[]: 
	
	 0  3  4  0  0  0  1  0  0  0  0  1  0  0  0  1  2  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,265
________________________________________________________________

Best solution found: 5330
Run Termination time: 31.01.2010 11:30:05
Run duration: 00:00:53.9531250
________________________________________________________________
